Connuence of the Bs-calculus
ثبت نشده
چکیده
منابع مشابه
A Confluent Relational Calculus for Higher-Order Programming with Constraints
We present the-calculus, a relational calculus parametrized with a logical constraint system. The-calculus provides for higher-order relational programming with rst-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform connuence of the-calculus. Uniform connu...
متن کاملSome Lambda Calculi with Categorial Sums and Products
We consider the simply typed-calculus with primitive re-cursion operators and types corresponding to categorical products and coproducts.. The standard equations corresponding to extensionality and to surjectivity of pairing and its dual are oriented as expansion rules. Strong normalization and ground (base-type) connuence is proved for the full calculus; full connuence is proved for the calcul...
متن کاملCombining Rst Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi
It is well known that connuence and strong normalization are preserved when combining left-linear algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that connuence fails when adding either the usual extensional rule for , or recursion together with the usual contraction rule for surjective pairing. We show that connuence and normalization are modular pro...
متن کاملCombining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi
It is well known that connuence and strong normalization are preserved when combining left-linear algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that connuence fails when adding either the usual extensional rule for , or recursion together with the usual contraction rule for surjective pairing. We show that connuence and normalization are modular pro...
متن کاملA Connuent Reduction for the Extensional Typed ?calculus with Pairs, Sums, Recursion and Terminal Object
We add extensional equalities for the functional and product types to the typed-calculus with not only products and terminal object, but also sums and bounded recursion (a version of recursion that does not allow recursive calls of innnite length). We provide a connuent and strongly normalizing (thus decidable) rewriting system for the calculus, that stays connuent when allowing unbounded recur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999